Quantified Mu-Calculus with Decision Modalities for Concurrent Game Structures
نویسندگان
چکیده
The emerging technology of interacting systems calls for new verification methods to ensure their reliability. Concurrent Game Structures are expressive abstract models for which several logics have been studied. Yet, these logics are not sufficiently expressive to support certain strategic situation which arise naturally. We propose a second-order mu-calculus enabling a straightforward specification of complex coalition strategies, and also yields a direct synthesis procedure via automata constructions. By translating different alternating-time logics into a natural fragment of our calculus, we recover optimal complexity bounds for these logics.
منابع مشابه
Satisfiability and Finite Model Property for the Alternating-Time mu-Calculus
This paper presents a decision procedure for the alternatingtime μ-calculus. The algorithm is based on a representation of alternating-time formulas as automata over concurrent game structures. We show that language emptiness of these automata can be checked in exponential time. The complexity of our construction meets the known lower bounds for deciding the satisfiability of the classic μ-calc...
متن کاملLogics and Games for True Concurrency
We study the underlying mathematical properties of various partial order models of concurrency based on transition systems, Petri nets, and event structures, and show that the concurrent behaviour of these systems can be captured in a uniform way by two simple and general dualities of local behaviour. Such dualities are used to define new mu-calculi and logic games for the analysis of concurren...
متن کاملThe mu-calculus and model-checking
This chapter presents a part of the theory of the mu-calculus that is relevant to the, broadly understood, model-checking problem. The mu-calculus is one of the most important logics in model-checking. It is a logic with an exceptional balance between expressiveness and algorithmic properties. The chapter describes in length the game characterization of the semantics of the mu-calculus. It disc...
متن کاملAn Automata Theoretic Decision Procedure for the Propositional Mu-Calculus
The propositional mu-calculus is a propositional logic of programs which incorporates a least fixpoint operator and subsumes the propositional dynamic logic of Fischer and Ladner, the infinite looping construct of Streett, and the game logic of Parikh. We give an elementary time decision procedure, using a reduction to the emptiness problem for automata on infinite trees. A small model theorem ...
متن کاملSelective Mu-calculus: New Modal Operators for Proving Properties on Reduced Transition Systems
In model checking for temporal logic, the correctness of a (concurrent) system with respect to a desired behavior is veriied by checking whether a structure that models the system satisses a formula describing the behaviour. Most existing veriication techniques, and in particular those deened for concurrent calculi like as CCS, are based on a representation of the concurrent system by means of ...
متن کامل